Average Case Complexity of Linear Multivariate
نویسنده
چکیده
We study the average case complexity of a linear multivariate problem (LMP) defined on functions of d variables. We consider two classes of information. The first Λ std consists of function values and the second Λ all of all continuous linear functionals. Tractability of LMP means that the average case complexity is O((1/ε) p) with p independent of d. We prove that tractability of an LMP in Λ std is equivalent to tractability in Λ all , although the proof is not constructive. We provide a simple condition to check tractability in Λ all. We also address the optimal design problem for an LMP by using a relation to the worst case setting. We find the order of the average case complexity and optimal sample points for multivariate function approximation. The theoretical results are illustrated for the folded Wiener sheet measure.
منابع مشابه
A Survey of Average Case Complexity for Linear Multivariate Problems*
We survey recent results on the average case complexity for linear multivariate problems. Our emphasis is on problems defined on spaces of functions of d variables with large d. We present the sharp order of the average case complexity for a number of linear multivariate problems as well as necessary and sufficient conditions for the average case complexity not to be exponential in d. DOI: 10.3...
متن کاملAverage Case Complexity of Linear Multivariate Problems Part Ii: Applications
We apply the theoretical results of Part I to linear multivariate problems LMP equipped with the folded Wiener sheet measure. We are particularly interested in multivariate weighted integration and multivariate function approximation. We prove that any LMP which satisses (A.1) of Part I is tractable and its exponent is at most 2. We show that optimal or nearly optimal sample points can be deriv...
متن کاملPhase II monitoring of auto-correlated linear profiles using linear mixed model
In many circumstances, the quality of a process or product is best characterized by a given mathematical function between a response variable and one or more explanatory variables that is typically referred to as profile. There are some investigations to monitor auto-correlated linear and nonlinear profiles in recent years. In the present paper, we use the linear mixed models to account autocor...
متن کاملLinear regression without correspondence
This article considers algorithmic and statistical aspects of linear regression when the correspondence between the covariates and the responses is unknown. First, a fully polynomial-time approximation scheme is given for the natural least squares optimization problem in any constant dimension. Next, in an average-case and noise-free setting where the responses exactly correspond to a linear fu...
متن کاملApproximation of infinitely differentiable multivariate functions is intractable
We prove that L∞-approximation of C ∞-functions defined on [0, 1]d is intractable and suffers from the curse of dimensionality. This is done by showing that the minimal number of linear functionals needed to obtain an algorithm with worst case error at most ε ∈ (0, 1) is exponential in d. This holds despite the fact that the rate of convergence is infinite.
متن کامل